Multi-Keyword Ranked Searchable Encryption with the Wildcard Keyword for Data Sharing in Cloud Computing

نویسندگان

چکیده

Abstract Multi-keyword ranked searchable encryption (MRSE) supports multi-keyword contained in one query and returns the top-k search results related to keyword set. It realized effective on encrypted data. Most previous works about MRSE can only make complete rank server-side. However, with more practice, users may not be able express some keywords completely when searching. Server-side ranking increases possibilities of server inferring queried, leading leakage user’s sensitive information. In this paper, we propose a new system named ‘multi-keyword wildcard (MRSW)’. allows set contain by using Bloom filter (BF). Using hierarchical clustering algorithm, tree (CBF-Tree) is constructed, which improves efficiency search. By constructing modified inverted index (MII) table basis term frequency-inverse document frequency (TF-IDF) rule, function MRSW performed user. proved secure under adaptive chosen-keyword attack (CKA2) model, experiments real data from web science indicate that efficient practical.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Searchable Encryption and Fuzzy Keyword Search in Cloud Computing Technology

Cloud computing is a technology that uses the internet and central remote servers to keep up data and applications. As becomes more mature, many organizations and individuals are attracted in storing more accessible data e.g. personal data files, company related information in the cloud. This technology allows for much more efficient computing by centralizing storage, memory, processing and ban...

متن کامل

Searchable Encryption with Keyword-Recoverability

Searchable encryption has many applications including email systems and storage systems. The usefulness of searchable encryption derives from its support of keyword-testability. Keyword-testability means that a receiver of a ciphertext can test whether the ciphertext contains a specific keyword. Recently, Bellare et al. suggested an efficientlysearchable encryption scheme with keyword-recoverab...

متن کامل

Searchable Keyword-Based Encryption

To solve the problem of searching on encrypted data, many keyword search schemes have been proposed in recent years. The goal of such schemes is to enable a user to give an untrusted storage server the ability only to test whether an encrypted document contains a few keywords without learning anything else about the document. In this paper, we are concerned with decrypting the searched results ...

متن کامل

Fault-tolerant Verifiable Keyword Symmetric Searchable Encryption in Hybrid Cloud

As cloud computing is increasingly expanding its application scenario, it is vital for cloud storage customers not to sacrifice the confidentiality of sensitive data while making fullest use of operational functionality of cloud secure systems. Although traditional searchable encryption can well solve exact keyword search on encrypted data with retrieving files by search interest, it does not w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Computer Journal

سال: 2021

ISSN: ['0010-4620', '1460-2067']

DOI: https://doi.org/10.1093/comjnl/bxab153